Cubic Graphs with Small Independence Ratio
نویسندگان
چکیده
منابع مشابه
Cycles in graphs with large independence ratio
where α(X) is the independence number of the subgraph of G induced by X. The independence ratio is a relaxation of the chromatic number χ(G) in the sense that χ(G) ≥ ι(G) for every graph G, while for many natural classes of graphs these quantities are almost equal. In this paper, we address two old conjectures of Erdős on cycles in graphs with large chromatic number and a conjecture of Erdős an...
متن کاملCubic Cayley graphs with small diameter
In this paper we apply Pólya’s Theorem to the problem of enumerating Cayley graphs on permutation groups up to isomorphisms induced by conjugacy in the symmetric group. We report the results of a search of all three-regular Cayley graphs on permutation groups of degree at most nine for small diameter graphs. We explore several methods of constructing covering graphs of these Cayley graphs. Exam...
متن کاملFinding Smooth Graphs with Small Independence Numbers
In this paper we formulate an algorithm for finding smooth graphs with small independence numbers. To this end we formalize a family of satisfaction problems and propose a branch-and-bound-based approach for solving them. Strong bounds are obtained by exploiting graph-theoretic aspects including new results obtained in cooperation with leading graph theorists. Based on a partial solution we der...
متن کاملA new proof of the independence ratio of triangle-free cubic graphs
Staton proved that every triangle-free graph on n vertices with maximum degree three has an independent set of size at least 5n/14. A simpler proof was found by Jones. We give a yet simpler proof, and use it to design a linear-time algorithm to find such an independent set. Let G be a triangle-free graph on n vertices with maximum degree three. By Brooks’ theorem [1] G is 3-colorable; consideri...
متن کاملOn the independence ratio of distance graphs
A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph G is the maximum density of an independent set in G. Lih, Liu, and Zhu [31] showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7272